An Efficient Open Vote Network for Multiple Candidates

In 2010, Hao et al. proposed an efficient decentralized voting protocol known as Open Vote Network (OV-Net), which does not require a trusted third party to count the votes or private channel protect ballot secrecy. last decade, various studies have been conducted solve some limitations of OV-Net, such fairness and robustness. However, unresolved problem exists in OV-Net (and its variants), is limited scalability for multiple candidates. The computational cost tallying, increases exponentially with number candidates, causes problem. Therefore, this study, we by proposing variant candidates showing that tallying linearly Regarding security, prove our satisfies secrecy dispute-freeness formal security models, based on decision Diffie-Hellman assumption non-interactive zero-knowledge properties, respectively. Moreover, regarding efficiency, compare performance traditional from theoretical standpoint present experimental results show considerably more than numbers voters increase.